//
// Created by francklinson on 2021/12/2 AT 9:26.
// May Saint Diana bless you!
//

#include <iostream>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <algorithm>
#include <functional>
#include <climits>
#include <string>

using namespace std;

class Solution {
public:
    vector<int> getNoZeroIntegers(int n) {
        for (int i = 1; i < n; ++i) {
            if (noZero(i) && noZero(n - i))
                return vector<int>{i, n - i};
        }
        return vector<int>{};
    }

    bool noZero(int x) {
        while (x){
            int bit = x % 10;
            if (bit == 0)
                return false;
            x /= 10;
        }
        return true;
    }
};

int main() {
    Solution solution;
    vector<int> ans = solution.getNoZeroIntegers(11);
    for (const int &x: ans) cout << x << endl;
    return 0;
}

